Multiplicativedepth

由 T Häner 著作 · 2020 · 被引用 7 次 — We describe a dynamic programming based logic synthesis algorithm to reduce the multiplicative depth in logic networks. It makes use of cut ...

2019年9月2日 — The multiplicative depth is the maximal number of sequential homomorphic multiplications which can be performed on fresh ciphertexts such that ...

For the majority of homomorphic encryption schemes, the multiplicative depth of circuits is the main practical limitation in performing computations over ...

由 P Aubry 著作 · 2019 · 被引用 32 次 — The multiplicative depth is the maximal number of consecutive multiplications for which an homomorphic encryption scheme was parameterized. In ...

由 C Bonte 著作 · 2020 · 被引用 5 次 — Abstract. String search finds occurrences of patterns in a larger text. This general problem occurs in various application scenarios, f.e. Internet search, text ...

由 A Desai 著作 · 2020 — Abstract. An extensive research of MPC protocols in different adver- sarial settings over the past few years has led to various improvements in this domain.

由 S Carpov 著作 · 2017 · 被引用 30 次 — Abstract. In this work we propose a multi-start heuristic which aims at minimiz- ing the multiplicative depth of boolean circuits.

由 P Aubry 著作 · 2019 · 被引用 32 次 — The multiplicative depth is the maximal number of consecutive multiplica- tions for which an homomorphic encryption scheme was parameterized. In this work we ...

由 C Bonte 著作 · 2020 · 被引用 5 次 — Abstract. String search finds occurrences of patterns in a larger text. This general problem occurs in various application scenarios, f.e. Internet.